Discrete Wavelet Analysis for Fast Optic Flow Computation

نویسنده

  • Christophe P. Bernard
چکیده

This paper describes a new way to compute the optic flow, based on a discrete wavelet basis analysis. The optic flow is estimated locally by the projection of the differential optic flow equation onto wavelets. The resulting linear systems are small and of fixed size (3-5 equations). They are solved to find out the visual displacement. In this way, we circumvent the classical problems of time aliasing and aperture. Moreover, the coefficients of the systems can be computed with a set of wavelet transforms, and the resolution of these systems is of similar complexity. The algorithm has thus a complexity of only O(N) (if one image of the sequence has N pixels). We show that our approach permits the measurement of illumination changes, making the optic flow computation more robust. A consistency result is also proven, which states that this method provides asymptotically correct flow estimates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Optic Flow Computation with Discrete Wavelets

This paper describes a new way to compute the optical ow based on dyadic ltering and subsampling pyramids. It is based on the projection of the optical ow equation on vectors of a wavelet basis. This algorithm is thus of complexity O(N) if one image of the sequence has N pixels, and opens the way to eecient and unexpensive optical ow computation. Features of this algorithm include multiscale tr...

متن کامل

Nonlinear Filtering of Time Series Using the Wavelet Transform

A fast nonlinear filtering algorithm is presented. This algorithm propagates the entire conditional probability functions recursively in a computationally efficient manner using the discrete wavelet transform. With the multiresolution analysis capability offered by the wavelet transform we can speed up the computation by ignoring the high-frequency details of the probability function up to a ce...

متن کامل

Fast Discrete Wavelet Transformation Using FPGAs and Distributed Arithmetic

The discrete wavelet transform has gained the reputation of being a very effective signal analysis tool for many practical applications. However, due to its computation-intensive nature, current implementations of the transform fall short of meeting real-time processing requirements of most applications. This paper describes a parallel implementation of the discrete wavelet transform and its in...

متن کامل

Fast Approximate Fourier Transform via Wavelets Transform

We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coeecients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational comple...

متن کامل

Design of High Speed and Low Power Multipliers

Multipliers are frequently used in DSP, Image processing architectures and microprocessors. Fast Fourier Transform (FFT), Discrete Wavelet Transform(DWT) and auto-correlation are the few important areas where multipliers are mostly used. As switching and critical computations of a multiplier are high, compared to other datapath units of a processing architecture, design of low power, high speed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999